Using Symbolic Analysis to Optimize Explicit Reachability Analysis
نویسنده
چکیده
Advanced techniques in formal veriication have allowed us to verify larger systems using less memory, but run-time requirement is becoming another limiting factor. This work proposes the use of symbolic analysis to extract high-level information about a design , and develops optimizations that use such information to reduce the run-time requirement of explicit reachability analysis. This work also investigates how the optimizations can be used in conjunction with two state reduction techniques: symmetry reduction and reversible rule reduction.
منابع مشابه
Subsumer-First: Steering Symbolic Reachability Analysis
Symbolic reachability analysis provides a basis for the verification of software systems by offering algorithmic support for the exploration of the program state space when searching for proofs or counterexamples. The choice of exploration strategy employed by the analysis has direct impact on its success, whereas the ability to find short counterexamples quickly and—as a complementary task—to ...
متن کاملSymbolic Shape Analysis Diploma Thesis
Shape analysis deals with the synthesis of invariants for programs manipulating heap-allocated data structures. Explicit shape analysis algorithms do not scale very well. This work proposes a framework for symbolic shape analysis that addresses this problem. Our contribution is a framework that allows to abstract programs with heap-allocated data symbolically by Boolean programs. For this purpo...
متن کاملDiagnosing Unreachable States Using Property-Directed Reachability
Probabilistic software analysis aims at quantifying how likely a target event is to occur, given a probabilistic characterization of the behavior of a program or of its execution environment. Examples of target events may include an uncaught exception, the invocation of a certain method, or the access to confidential information.We are working on a symbolic execution approach to probabilistic s...
متن کاملSymbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, which can cause a given top level event, e.g. a system malfunction, to occur. Generating fault trees is particularly critical in the case of reactive systems, as hazards can be the result of complex interactions involvi...
متن کاملSymbolic Reachability Analysis of B Through ProB and LTSmin
We present a symbolic reachability analysis approach for B that can provide a significant speedup over traditional explicit state model checking. The symbolic analysis is implemented by linking ProB to LTSmin, a high-performance language independent model checker. The link is achieved via LTSmin’s Pins interface, allowing ProB to benefit from LTSmin’s analysis algorithms, while only writing a f...
متن کامل